RAINBOW CONNECTION PADA GRAF DENGAN KONEKTIFITAS 1
نویسندگان
چکیده
منابع مشابه
Validasi data dengan menggunakan objek lookup pada borland delphi 7.0
s: Developing an application with some tables must concern the validation of input (scpecially in Table Child). In order to maximize the accuracy and input data validation. Its called lookup (took data from other dataset). There are 2 (two) ways to lookup data from Table Parent: 1) Using Objects (DBLookupComboBox & DBLookupListBox), or 2) Arranging The Properties Of Fields Data Type (shown by u...
متن کاملMultidimensi Pada Data Warehouse Dengan Menggunakan Rumus Kombinasi
Multidimensional in data warehouse is a compulsion and become the most important for information delivery, without multidimensional data warehouse is incomplete. Multidimensional give the able to analyze business measurement in many different ways. Multidimensional is also synonymous with online analytical processing (OLAP).
متن کاملOn the Rainbow Vertex - Connection 1
A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertexconnected. It was proved that ifG is a graph of order n with minimum degree δ, then rvc(G) < 11n/δ. I...
متن کاملOn Rainbow Connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this paper we prove several non-trivial upper bounds for rc(G), as well as determine sufficient conditions that gua...
متن کاملProgress on Rainbow Connection
An edge-coloured graph G is called rainbow-connected if any two vertices are connected by a path whose edges have different colours. This concept of rainbow connection in graphs was recently introduced by Chartrand et al. in [4]. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order to make G rainbow connected. An easy ob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Matematika UNAND
سال: 2013
ISSN: 2721-9410,2303-291X
DOI: 10.25077/jmu.2.2.92-98.2013